Degree-Based Entropy for a Non-Kekulean Benzenoid Graph

نویسندگان

چکیده

Tessellations of kekulenes and cycloarenes have a lot potential as nanomolecular belts for trapping transporting heavy metal ions chloride because they the best electronic properties pore sizes. The aromaticity, superaromaticity, chirality, novel electrical magnetic class known been subject several experimental theoretical studies. Through topological computations superaromatic structures with pores, we investigate entropies characterization different tessellations kekulenes. Using indices, biological activity underlying structure is linked to its physical in (QSPR/QSAR) research. There wide range indices accessible, including degree-based which are used this work. With total π -electron energy, these iteration. In addition, use graph determine structural information non-Kekulean benzenoid graph. article, study crystal id="M2"> K n then calculate some by using indices. We also relationship between entropies. This very helpful chemist physicochemical chemical. These numerical values correlate facts chemical reactivity, activities, properties.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

Degree-based graph construction

Degree-based graph construction is an ubiquitous problem in network modeling [1, 2], ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative in...

متن کامل

A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers

Kinkar Chandra Das 1,* and Matthias Dehmer 2 1 Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Korea 2 Department of Biomedical Computer Science and Mechatronics, University for Health Sciences, Medical Informatics and Technology (UMIT), Eduard Wallnoefer Zentrum, A-6060 Hall in Tyrol, Austria; [email protected] * Correspondence: [email protected]; Tel.: +82-31-2...

متن کامل

Generalized Degree-Based Graph Entropies

Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies ...

متن کامل

ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH

Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics

سال: 2022

ISSN: ['2314-4785', '2314-4629']

DOI: https://doi.org/10.1155/2022/2288207